Handling Slice Permutations Variability in Tensor Recovery

This work studies the influence of slice permutations on tensor recovery, which is derived from a reasonable assumption about algorithm, i.e. changing data order should not affect effectiveness algorithm. However, as we will discussed in this paper, satisfied by recovery under some cases. We call interesting problem Slice Permutations Variability (SPV) recovery. In discuss SPV several key problems theoretically and experimentally. The obtained results show that there huge gap between using with different slices sequences. To overcome develop novel algorithm Minimum Hamiltonian Circle for (TRSPV) exploits low dimensional subspace structures within more exactly. best our knowledge, first to effectively solve experimental demonstrate proposed eliminating